A testing scenario for probabilistic automataSTOELINGA, Mariëlle; VAANDRAGER, Frits.Lecture notes in computer science. 2003, pp 464-477, issn 0302-9743, isbn 3-540-40493-7, 14 p.Conference Paper

Compositionality for probabilistic automataLYNCH, Nancy; SEGALA, Roberto; VAANDRAGER, Frits et al.Lecture notes in computer science. 2003, pp 208-221, issn 0302-9743, isbn 3-540-40753-7, 14 p.Conference Paper

Realization of probabilistic automata : Categorical approachMATEUS, Paulo; SERNADAS, Amflcar; SERNADAS, Cristina et al.Lecture notes in computer science. 2000, pp 237-251, issn 0302-9743, isbn 3-540-67898-0Conference Paper

Symbolic model checking for probabilistic processesBAIER, C; CLARKE, E. M; HARTONAS-GARMHAUSEN, V et al.Lecture notes in computer science. 1997, pp 430-440, issn 0302-9743, isbn 3-540-63165-8Conference Paper

Identification of probabilistic cellular automataADAMATSKIY, A. I.Soviet journal of computer and systems sciences. 1992, Vol 30, Num 3, pp 118-123, issn 0882-4002Article

On partially blind multihead finite automataIBARRA, Oscar H; RAVIKUMAR, Bala.Theoretical computer science. 2006, Vol 356, Num 1-2, pp 190-199, issn 0304-3975, 10 p.Article

ZERLEGUNGSSAETZE FUER NICHTDETERMINITISCHE AUTOMATEN = ANALYSE DES AUTOMATES NON DETERMINISTESSTRASSNER K.1979; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DDR; DA. 1979; VOL. 15; NO 1-2; PP. 95-104; ABS. ENG/RUS; BIBL. 5 REF.Article

ON TWO STATE COMPLETELY ISOLATED PROBABILISTIC SEQUENTIAL MACHINES.LEE SC; ASAI H.1977; INFORM. AND CONTROL.; U.S.A.; DA. 1977; VOL. 34; NO 1; PP. 22-37; BIBL. 4 REF.Article

QUELQUES METHODES DE DECOMPOSITION SPATIO-TEMPORELLE DES AUTOMATES PROBABILISTESGIORGADZE A KH.1977; DOKL. AKAD. NAUK S.S.S.R.; S.S.S.R.; DA. 1977; VOL. 232; NO 4; PP. 783-785; BIBL. 5 REF.Article

UNE APPROCHE DE LA DECOMPOSITION D'UN AUTOMATE PROBABILISTEGIORGADZE A KH.1976; PROBL. CONTROL INFORM. THEORY; HUNGARY; DA. 1976; VOL. 5; NO 4; PP. 321-327; ABS. ANGL.; BIBL. 3 REF.Article

SUR UNE APPLICATION DU PRINCIPE POUR MINIMISER L'INTERDEPENDANCE DANS LES AUTOMATES PROBABILISTESMARTIN L; REISCHER C.1980; ANN. DISCRETE MATH.; NLD; DA. 1980; VOL. 8; PP. 189-193; BIBL. 6 REF.Conference Paper

A CLASS OF OPTIMAL PERFORMANCE DIRECTED PROBABILISTIC AUTOMATA.DEVROYE LP.1976; I.E.E.E. TRANS. SYST. MAN CYBERN.; U.S.A.; DA. 1976; VOL. 6; NO 11; PP. 777-783; BIBL. 24 REF.Article

SUR DES PROPRIETES ERGODIQUES DE LA MESURE LIMITE DU MODELE DE STAVSKAYA = ON ERGODIC PROPERTIES OF THE LIMIT MEASURE OF THE STAVSKAYA MODELDANG TRAN BA.1981; ; FRA; DA. 1981; 35 P.; 30 CM; BIBL. 15 REF.; TH. 3E CYCLE: MATH./PARIS 7/1981Thesis

AUTOMATAS PROBABILISTICOS, UN NUEVO ALGORITMO DE APRENDIZAGE = AUTOMATES PROBABILISTES. UN NOUVEL ALGORITHME D'APPRENTISSAGEMARAVALL GOMEZ ALLENDE D.1979; REV. R. ACAD. CI. EXACT. FIS. NAT. MADRID; ESP; DA. 1979; VOL. 73; NO 2; PP. 234-238; ABS. ENGArticle

Decision algorithms for probabilistic bisimulationCATTANI, Stefano; SEGALA, Roberto.Lecture notes in computer science. 2002, pp 371-385, issn 0302-9743, isbn 3-540-44043-7, 15 p.Conference Paper

On the class of languages recognizable by 1-way quantum finite automataAMBAINIS, Andris; KIKUSTS, Arnolds; VALDATS, Maris et al.Lecture notes in computer science. 2001, pp 75-86, issn 0302-9743, isbn 3-540-41695-1Conference Paper

Verification of parameterized systems by dynamic induction on diagramsMANNA, Z; SIPMA, H. B.Lecture notes in computer science. 1999, pp 25-43, issn 0302-9743, isbn 3-540-66202-2Conference Paper

A time complexity gap for two-way probabilistic finite-state automataDWORK, C; STOCKMEYER, L.SIAM journal on computing (Print). 1990, Vol 19, Num 6, pp 1011-1023, issn 0097-5397, 13 p.Conference Paper

Immunity and simplicity in relativizations of probabilistic complexity classesBALCAZAR, J. L; RUSSO, D. A.Informatique théorique et applications (Imprimé). 1988, Vol 22, Num 2, pp 227-244, issn 0988-3754Article

Absorbing and ergodic discretized two-action learning automataOOMMEN, B. J.IEEE transactions on systems, man, and cybernetics. 1986, Vol 16, Num 2, pp 282-293, issn 0018-9472Article

Probabilistic reversible automata and quantum automataGOLOVKINS, Marats; KRAVTSEV, Maksim.Lecture notes in computer science. 2002, pp 574-583, issn 0302-9743, isbn 3-540-43996-X, 10 p.Conference Paper

Test generation derived from model-checkingJERON, T; MOREL, P.Lecture notes in computer science. 1999, pp 108-121, issn 0302-9743, isbn 3-540-66202-2Conference Paper

Enumeration of directed site animals on the decorated square latticesAGHA AFSAR ALI.Physica. A. 1994, Vol 202, Num 3-4, pp 520-528, issn 0378-4371Article

Cellular automata (Geneva, 9-11 October 2002)Bandini, Stefania; Chopard, Bastien; Tomassini, Marco et al.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-44304-5, XI, 367 p, isbn 3-540-44304-5Conference Proceedings

Axiomatizations for probabilistic bisimulationBANDINI, Emanuele; SEGALA, Roberto.Lecture notes in computer science. 2001, pp 370-381, issn 0302-9743, isbn 3-540-42287-0Conference Paper